Edge Colored Hypergraphic Arrangements
نویسنده
چکیده
A subspace arrangement defined by intersections of hyperplanes of the braid arrangement can be encoded by an edge colored hypergraph. It turns out that the characteristic polynomial of this type of subspace arrangement is given by a generalized chromatic polynomial of the associated edge colored hypergraph. The main result of this paper supplies a sufficient condition for the existence of non-trivial Massey products of the subspace arrangements complex complement. This is accomplished by studying a spectral sequence associated to the Lie coalgebras of Sinha and Walter.
منابع مشابه
Realizing degree sequences with k-edge-connected uniform hypergraphs
An integral sequence d = (d1, d2, . . . , dn) is hypergraphic if there is a simple hypergraph H with degree sequence d, and such a hypergraph H is a realization of d. A sequence d is r-uniform hypergraphic if there is a simple r-uniform hypergraph with degree sequence d. Similarly, a sequence d is r-uniformmulti-hypergraphic if there is an r-uniformhypergraph (possibly with multiple edges) with...
متن کاملOn the Set of Simple Hypergraph Degree Sequences
For a given m, 0 < m ≤ 2, let Dm(n) denote the set of all hypergraphic sequences for hypergraphs with n vertices and m hyperedges. A hypergraphic sequence in Dm(n) is upper hypergraphic if all its components are at least m/2. Let ?̂?m(n) denote the set of all upper hypergraphic sequences. A structural characterization of the lowest and highest rank maximal elements of ?̂?m(n) was provided in an e...
متن کاملEla Spectral Properties of Oriented Hypergraphs
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are ...
متن کاملEfficient Algorithms for Solving Hypergraphic Steiner Tree Relaxations in Quasi-Bipartite Instances
We consider the Steiner tree problem in quasi-bipartite graphs, where no two Steiner vertices are connected by an edge. For this class of instances, we present an efficient algorithm to exactly solve the so called directed component relaxation (DCR), a specific form of hypergraphic LP relaxation that was instrumental in the recent break-through result by Byrka et al. [2]. Our algorithm hinges o...
متن کاملA Note on Generalized Edges∗
Although most relational data is represented via relatively simple dyadic (and occasionally hypergraphic) structures, a much wider range of relational formalisms is possible. These alternatives provide more natural representations for relationships with complex edge structure (e.g., those in which there are many distinct ways of participating in a given edge, in which edges require particular n...
متن کامل